unique decomposition property

См. также в других словарях:

• Tree decomposition — A graph with eight vertices, and a tree decomposition of it onto a tree with six nodes. Each graph edge connects two vertices that are listed together at some tree node, and each graph vertex is listed at the nodes of a contiguous subtree of the… …   Wikipedia

• Polar decomposition — In mathematics, particularly in linear algebra and functional analysis, the polar decomposition of a matrix or linear operator is a factorization analogous to the polar form of a nonzero complex number z where r is the absolute value of z (a… …   Wikipedia

• Modular decomposition — In graph theory, the modular decomposition is a decomposition of an undirected graph into subsets of vertices called modules. A module is a generalization of a connected component of a graph. Unlike connected components, however, one module can… …   Wikipedia

• Cholesky decomposition — In linear algebra, the Cholesky decomposition or Cholesky triangle is a decomposition of a Hermitian, positive definite matrix into the product of a lower triangular matrix and its conjugate transpose. It was discovered by André Louis Cholesky… …   Wikipedia

• Unicode character property — Unicode assigns character properties to each code point.[1] These properties can be used to handle characters (code points) in processes, like in line breaking, script direction right to left or applying controls. Slightly inconsequently, some… …   Wikipedia

• Approximately finite dimensional C*-algebra — In C* algebras, an approximately finite dimensional, or AF, C* algebra is one that is the inductive limit of a sequence of finite dimensional C* algebras. Approximate finite dimensionality was first defined and described combinatorially by… …   Wikipedia

• Compact operator on Hilbert space — In functional analysis, compact operators on Hilbert spaces are a direct extension of matrices: in the Hilbert spaces, they are precisely the closure of finite rank operators in the uniform operator topology. As such, results from matrix theory… …   Wikipedia

• Semimartingale — In probability theory, a real valued process X is called a semimartingale if it can be decomposed as the sum of a local martingale and an adapted finite variation process.Semimartingales are good integrators , forming the largest class of… …   Wikipedia

• Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… …   Wikipedia

• Monoidal t-norm logic — Monoidal t norm based logic (or shortly MTL), the logic of left continuous t norms, is one of t norm fuzzy logics. It belongs to the broader class of substructural logics, or logics of residuated lattices;[1] it extends the logic of commutative… …   Wikipedia

• Square-free — In mathematics, an element r of a unique factorization domain R is called square free if it is not divisible by a non trivial square. That is, every s such that s^2mid r is a unit of R .Square free elements may be also characterized using their… …   Wikipedia